Proof of an Intersection Theorem via Graph Homomorphisms
نویسندگان
چکیده
منابع مشابه
Proof of an Intersection Theorem via Graph Homomorphisms
Let 0 ≤ p ≤ 1/2 and let {0, 1} be endowed with the product measure μp defined by μp(x) = p |x|(1 − p)n−|x|, where |x| = ∑ xi. Let I ⊆ {0, 1} n be an intersecting family, i.e. for every x, y ∈ I there exists a coordinate 1 ≤ i ≤ n such that xi = yi = 1. Then μp(I) ≤ p. Our proof uses measure preserving homomorphisms between graphs. One of the fundamental questions first studied in extremal graph...
متن کاملAn Introduction to Graph Homomorphisms
This paper aims to give a focused introduction to algebraic graph theory accessible to mathematically mature undergraduates. We will begin by giving some standard definitions, then expanding our focus to specifically study properties of graph homomorphisms in the context of constraint satisfaction problems (graph coloring in disguise). In particular, we will be discussing the idea of graph colo...
متن کاملGraph Homomorphisms with Complex Values: A Dichotomy Theorem
Graph homomorphism has been studied intensively. Given an m ×m symmetric matrix A, the graph homomorphism function is defined as
متن کاملA short proof of a cross-intersection theorem of Hilton
Families A1, ...,Ak of sets are said to be cross-intersecting if Ai ∩ Aj 6= ∅ for any Ai ∈ Ai and Aj ∈ Aj , i 6= j. A nice result of Hilton that generalises the Erd®sKo-Rado (EKR) Theorem says that if r ≤ n/2 and A1, ..., Ak are cross-intersecting sub-families of ( [n] r ) , then
متن کاملAnother proof of Banaschewski's surjection theorem
We present a new proof of Banaschewski's theorem stating that the completion lift of a uniform surjection is a surjection. The new procedure allows to extend the fact (and, similarly, the related theorem on closed uniform sublocales of complete uniform frames) to quasi-uniformities ("not necessarily symmetric uniformities"). Further, we show how a (regular) Cauchy point on a closed uniform subl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2006
ISSN: 1077-8926
DOI: 10.37236/1144